#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include <limits.h>
#include "tree.h"

using namespace std;


void printTree(Tree *root1, Tree *root2)
{
    stack<Tree *> stk1;
    stack<Tree *>stk2;


    while(root1 || !stk.empty() || root2 

}

int main(int argc, char **argv)
{
    int input1[] = {2,1,3};
    int input2[] = {5,4,6};
    Tree *root1 = NULL, *root2 = NULL;

    for (int i = 0; i < sizeof(input1)/sizeof(int); i++) {
        TreeInsert(root1, input1[i]);
    }
    print_ascii_tree(root1);
    for (int i = 0; i < sizeof(input2)/sizeof(int); i++) {
        TreeInsert(root2, input2[i]);
    }
    print_ascii_tree(root2);

    printTree(root1, root2);
}
